An abstract averaging theorem

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An abstract standardisation theorem

The standardisation theorem is a key theorem in the-calculus. It implies that any normal form can be reached by the normal order (leftmost outermost) strategy. The theorem states that any reduction may be rearranged in a top-down and left-to-right order. This also holds in orthogonal term rewriting systems (TRS), although the left-to-right order is more subtle. We give a new presentation of the...

متن کامل

An Abstract Factorization Theorem for Explicit Substitutions

We study a simple form of standardization, here called factorization, for explicit substitutions calculi, i.e. lambda-calculi where beta-reduction is decomposed in various rules. These calculi, despite being non-terminating and non-orthogonal, have a key feature: each rule terminates when considered separately. It is well-known that the study of rewriting properties simplifies in presence of te...

متن کامل

An Averaging Theorem for Nonlinear Schrödinger Equations with Small Nonlinearities

Consider nonlinear Schrödinger equations with small nonlinearities d dt u+ i(−△u+ V (x)u) = ǫP(△u, u, x), x ∈ T. (∗) Let {ζ1(x), ζ2(x), . . . } be the L2-basis formed by eigenfunctions of the operator −△+ V (x). For any complex function u(x), write it as u(x) = ∑ k>1 vkζk(x) and set Ik(u) = 1 2 |vk| . Then for any solution u(t, x) of the linear equation (∗)ǫ=0 we have I(u(t, ·)) = const. In thi...

متن کامل

Sum Formula for Maximal Abstract Monotonicity and Abstract Rockafellar’s Surjectivity Theorem

In this paper, we present an example in which the sum of two maximal abstract monotone operators is maximal. Also, we shall show that the necessary condition for Rockafellar’s surjectivity which was obtained in ([19], Theorem 4.3) can be sufficient.

متن کامل

Abstract Theorem Proving

Informally, a b s t r a c t i o n can be described as the process of mapping a representation of a problem into a new representation. The aim of the paper is to propose a theory of abstrac­ t ion. The generality of the framework is tested by formalizing and analyzing some work done in the past; i ts efficacy by giving a procedure which solves the '' false proof problem by avoid­ ing the use of ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Functional Analysis

سال: 1976

ISSN: 0022-1236

DOI: 10.1016/0022-1236(76)90071-9